ar X iv : c s . D B / 0 50 30 12 v 2 7 M ar 2 00 5 First - order Complete and Computationally Complete Query Languages for Spatio - Temporal Databases 1
نویسندگان
چکیده
We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be computable mappings that are also generic, meaning that the result of a query may only depend to a limited extent on the actual internal representation of the spatio-temporal data. Genericity is defined as invariance under groups of geometric transformations that preserve certain characteristics of spatio-temporal data (e.g., collinearity, distance, velocity, acceleration, ...). These groups depend on the notions that are relevant in particular spatio-temporal database applications. These transformations also have the distinctive property that they respect the monotone and unidirectional nature of time. We investigate different genericity classes with respect to the constraint database model for spatio-temporal databases and we identify sound and complete languages for the first-order and the computable queries in these genericity classes. We distinguish between genericity determined by time-invariant transformations, genericity notions concerning physical quantities and genericity determined by time-dependent transformations.
منابع مشابه
ar X iv : c s / 05 03 01 2 v 1 [ cs . D B ] 4 M ar 2 00 5 First - order Complete and Computationally Complete Query Languages for Spatio - Temporal Databases
We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be computable mappings that are also generic, meaning that the result of a query may only depend to a limited extent on the actual internal representation of the spatio-temporal data. Genericity is defined as invariance under groups of g...
متن کاملar X iv : 0 80 2 . 10 79 v 1 [ m at h . C A ] 8 F eb 2 00 8 p - ADIC MULTIRESOLUTION ANALYSIS AND WAVELET FRAMES
We study p-adic multiresolution analyses (MRAs). A complete characterisation of test functions generating MRAs (scaling functions) is given. We prove that only 1-periodic test functions may be taken as orthogonal scaling functions. We also suggest a method for the construction of wavelet functions and prove that any wavelet function generates a p-adic wavelet frame.
متن کاملar X iv : 0 71 0 . 35 19 v 1 [ cs . C C ] 1 8 O ct 2 00 7 P - matrix recognition is co - NP - complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملar X iv : 0 80 3 . 09 29 v 2 [ cs . D S ] 7 M ar 2 00 8 Graph Sparsification by Effective Resistances ∗
We present a nearly-linear time algorithm that produces high-quality sparsifiers of weighted graphs. Given as input a weighted graph G = (V,E,w) and a parameter ǫ > 0, we produce a weighted subgraph H = (V, Ẽ, w̃) of G such that |Ẽ| = O(n logn/ǫ) and for all vectors x ∈ R (1 − ǫ) ∑ uv∈E (x(u)− x(v))2wuv ≤ ∑ uv∈Ẽ (x(u)− x(v))2w̃uv ≤ (1 + ǫ) ∑ uv∈E (x(u)− x(v))2wuv. (1) This improves upon the spars...
متن کامل